Multigrid Solution of Automatically Generated High-Order Discretizations for the Biharmonic Equation

نویسندگان

  • Irfan Altas
  • Jonathan Dym
  • Murli M. Gupta
  • Ram P. Manohar
چکیده

In this work, we use a symbolic algebra package to derive a family of nite diierence approximations for the biharmonic equation on a 9 point compact stencil. The solution and its rst derivatives are carried as unknowns at the grid points. Dirichlet boundary conditions are thus incorporatednaturally. Since the approximations use the 9 point compact stencil, no special formulas are needed near the boundaries. Both second order and fourth order discretizations are derived. The fourth order approximations produce more accurate results than the 13 point classical stencil or the commonly used system of two second order equations coupled by the boundary condition. The method suuers from slow convergence when classical iteration methods such as Gauss-Seidel or SOR are employed. In order to alleviate this problem we propose several multigrid techniques which exhibit grid-independent convergence and solve the biharmonic equation in a small amount of computer time. Test results from three diierent problems, including Stokes ow in a driven cavity, are reported.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust multigrid preconditioners for the high-contrast biharmonic plate equation

We study the high-contrast biharmonic plate equation with HCT and Morley discretizations. We construct a preconditioner that is robust with respect to contrast size and mesh size simultaneously based on the preconditioner proposed by Aksoylu et al. (2008, Comput. Vis. Sci. 11, pp. 319–331). By extending the devised singular perturbation analysis from linear finite element discretization to the ...

متن کامل

High Accuracy and Multiscale Multigrid Computation for Three Dimensional Biharmonic Equations

The multiscale multigrid method is presented in this article to solve the linear systems arising from a fourth order discretisation. We used a symbolic algebra packageMathematica to derive a family of finite difference approximations on a 27 point compact stencil. The unknown solution and its second derivatives are carried as unknowns at selected grid points. A set of test problems are presente...

متن کامل

Multigrid Methods for a Biharmonic Problem with Boundary Conditions of the Cahn-Hilliard Type

We present multigrid methods for a biharmonic problem with boundary conditions of the Cahn-Hilliard type. These multigrid methods are based on discretizations obtained by a quadratic C interior penalty method. Since the finite element space is a standard space for second order problems, multigrid solves for second order problems can be used naturally in the smoothing steps. We will present theo...

متن کامل

hp-Multigrid as Smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows: Part I. Multilevel analysis

The hp-Multigrid as Smoother algorithm (hp-MGS) for the solution of higher order accurate space–time discontinuous Galerkin discretizations of advection dominated flows is presented. This algorithm combines p-multigrid with h-multigrid at all p-levels, where the h-multigrid acts as smoother in the p-multigrid. The performance of the hp-MGS algorithm is further improved using semi-coarsening in ...

متن کامل

Multigrid Solution for High-Order Discontinuous Galerkin Discretizations of the Compressible Navier-Stokes Equations

A high-order discontinuous Galerkin finite element discretization and p-multigrid solution procedure for the compressible Navier-Stokes equations are presented. The discretization has an element-compact stencil such that only elements sharing a face are coupled, regardless of the solution space. This limited coupling maximizes the effectiveness of the p-multigrid solver, which relies on an elem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1998